connected directed graph

英 [kəˈnektɪd dəˈrektɪd ɡræf]

美 [kəˈnektɪd dəˈrektɪd ɡræf]

连通的有向图

Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
After using rooted connected directed graph to describe the Web view model of bioinformatics secondary database, this paper addresses the bioinformatics background knowledge into the designation of the Web views and its related connection.
提出采用带根连通有向图来描述生物信息二级数据库的Web视图模型，以结合生物信息背景知识设计特定的生物信息Web视图及其间的相关关系。
We use a Rooted Connected Directed Graph to present XML document data model and give XML schema extraction algorithm. We also offer function of parsing XML document aud support to Web Service.
该系统采用带根连通有向图来表示XML文档数据模型，并给出相应的文档模式提取算法，XML文档数据的解析以及时Web服务的相关支持。
On All The Strong Connected Components of The Directed Graph
有向图的所有强连通分量
Ghouila& Houri gets a sufficient condition that a strongly connected digraph D is a directed H graph, that is.
Ghouila&Houri得到强连通有向图D是有向H图的充分条件。